Enumerative Problems Inspired by Mayer's Theory of Cluster Integrals
نویسندگان
چکیده
منابع مشابه
Enumerative Problems Inspired by Mayer's Theory of Cluster Integrals
The basic functional equations for connected and 2-connnected graphs can be traced back to the statistical physicists Mayer and Husimi. They play an essential role in establishing rigorously the virial expansion for imperfect gases. We first review these functional equations, putting the emphasis on the structural relationships between the various classes of graphs. We then investigate the prob...
متن کاملComplexity problems in enumerative combinatorics
We give a broad survey of recent results in Enumerative Combinatorics and their complexity aspects.
متن کاملSome Applications of Localization to Enumerative Problems
1 Dedicated to Bill Fulton on the occasion of his 60th birthday 1. Introduction. A problem in enumerative geometry frequently boils down to the computation of an integral on a moduli space. We have intersection theory (with Fulton's wonderful Intersection Theory [7] as a prime reference) to thank for allowing us to make rigorous sense of such integrals, but for their computations we often need ...
متن کاملA Meta-heuristic Algorithm for Global Numerical Optimization Problems inspired by Vortex in fluid physics
One of the most important issues in engineering is to find the optimal global points of the functions used. It is not easy to find such a point in some functions due to the reasons such as large number of dimensions or inability to derive them from the function. Also in engineering modeling, we do not have the relationships of many functions, but we can input and output them as a black box. The...
متن کاملNew Directions in Enumerative Chess Problems
Normally a chess problem must have a unique solution, and is deemed unsound even if there are alternatives that differ only in the order in which the same moves are played. In an enumerative chess problem, the set of moves in the solution is (usually) unique but the order is not, and the task is to count the feasible permutations via an isomorphic problem in enumerative combinatorics. Almost al...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Electronic Journal of Combinatorics
سال: 2004
ISSN: 1077-8926
DOI: 10.37236/1785